public class MiGong {
    public static void main(String[] args) {
        int [][] map = new int[8][7];
        for(int i = 0;i < 7;i++){
            map[0][i] = 1;
            map[7][i] = 1;
        }
        for(int i = 0;i < 7;i++){
            map[i][0] = 1;
            map[i][6] = 1;
        }
        map[3][1] = 1;
        map[3][2] = 1;
        System.out.println("========当前地图=========");
        for(int i = 0;i < map.length;i++){
            for(int j = 0;j < map[i].length;j++){
                System.out.print(map[i][j] + " ");
            }
            System.out.println();
        }
        M m1 = new M();
        m1.findWay2(map,1,1);
        System.out.println("\n=======找路的情况======");
        for(int i = 0;i < map.length;i++){
            for(int j = 0;j < map[i].length;j++){
                System.out.print(map[i][j] + " ");
            }
            System.out.println();
        }
    }
}
class M{
    //下->右->上->左
    public boolean findWay(int[][] map,int i,int j){
        if(map[6][5] == 2){
            return true;
        }else{
            if(map[i][j] == 0){
                map[i][j] = 2;
                if(findWay(map,i+1,j)){
                    return true;
                }
                if(findWay(map,i,j+1)){
                    return true;
                }
                if(findWay(map,i-1,j)){
                    return true;
                }if(findWay(map,i,j-1)){
                    return true;
                }else{
                    map[i][j] = 3;
                    return false;
                }
            }else{
                return false;
            }
        }
    }
    //上->右->下->左
    public boolean findWay2(int[][] map,int i,int j){
        if(map[6][5] == 2){
            return true;
        }else{
            if(map[i][j] == 0){
                map[i][j] = 2;
                if(findWay(map,i - 1,j)){
                    return true;
                }
                if(findWay(map,i,j + 1)){
                    return true;
                }
                if(findWay(map,i + 1,j)){
                    return true;
                }if(findWay(map,i,j - 1)){
                    return true;
                }else{
                    map[i][j] = 3;
                    return false;
                }
            }else{
                return false;
            }
        }
    }
}
